Tracking Causality in Distributed Computations
نویسندگان
چکیده
vii
منابع مشابه
Interval Tree Clocks A Logical Clock for Dynamic Systems
Ever since causality was introduced in distributed systems [11], it has played an important role in the modeling of distributed computations. In the absence of global clocks, causality remains as a means to reason about the order of distributed events. In order to be useful, causality is implemented by concrete mechanisms, such as Vector Clocks [7, 14] and Version Vectors [16], where a compress...
متن کاملComprehensive Distributed Garbage Collection by Tracking Causal Dependencies of Relevant Mutator Events
Comprehensive distributed garbage collection an objectoriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardise the scalability of these approaches: the bottleneck associated with having t o reach a global consensus before any resource can actually be reclaimed, and ...
متن کاملUniversal Constructs in Distributed Computations
This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building blocks to design two global universal constructs, termed segments and paths, that occur across nod...
متن کاملDetecting Causal Relationships in Distributed Computations: In Search of the Holy Grail1
Report SFB 124 15 / 92, December 1992 Abstract: The paper shows that characterizing the causal relationship between significant events is an important but non-trivial aspect for understanding the behavior of distributed programs. An introduction to the notion of causality and its relation to logical time is given; some fundamental results concerning the characterization of causality are present...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کامل